منابع مشابه
Inclusion Certificates and Simultaneous Convexification of Functions
We define the inclusion certificate as a measure that expresses each point in the domain of a collection of functions as a convex combination of other points in the domain. Using inclusion certificates, we extend the convex extensions theory to enable simultaneous convexification of functions. We discuss conditions under which the domain of the functions can be reduced without affecting the sim...
متن کاملConvexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For concave or cyclic meshes, however, a significant overhead is required to sort the grid cells in back to front order. In this paper we apply methods known from computational geometry to transform concave into convex grids. W...
متن کاملA Note on Conjugate Functions
1. Statement of results. The purpose of this note is to discuss as simply as possible a generalization of the classical theorem of M. Riesz2 on the integrability of the conjugate functions of functions in LP, and to point out some of the consequences for Fourier series. Suppose that(t) is a non-negative, convex function defined for t^O with (2t) ̂K<p(t) ior some constant K. Th...
متن کاملConvexification of Stochastic Ordering
We consider sets defined by the usual stochastic ordering relation and by the second order stochastic dominance relation. Under fairy general assumptions we prove that in the space of integrable random variables the closed convex hull of the first set is equal to the second set.
متن کاملConvexification of Neural Graph
Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms and functions. Further, iteratively propagating from node to node along edge, we prove that “regarding the neural graph without triangles, it is nearly convex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1975
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-11567